首页> 外文OA文献 >Zeta functions and asymptotic additive bases with some unusual sets of primes
【2h】

Zeta functions and asymptotic additive bases with some unusual sets of primes

机译:Zeta函数和渐近加性基数与一些不寻常的集合   素数

代理获取
本网站仅为用户提供外文OA文献查询和代理获取服务,本网站没有原文。下单后我们将采用程序或人工为您竭诚获取高质量的原文,但由于OA文献来源多样且变更频繁,仍可能出现获取不到、文献不完整或与标题不符等情况,如果获取不到我们将提供退款服务。请知悉。

摘要

Fix $\delta\in(0,1]$, $\sigma_0\in[0,1)$ and a real-valued function$\varepsilon(x)$ for which $\limsup_{x\to\infty}\varepsilon(x)\le 0$. For everyset of primes ${\mathcal P}$ whose counting function $\pi_{\mathcal P}(x)$satisfies an estimate of the form $$\pi_{\mathcalP}(x)=\delta\,\pi(x)+O\bigl(x^{\sigma_0+\varepsilon(x)}\bigr),$$ we define azeta function $\zeta_{\mathcal P}(s)$ that is closely related to the Riemannzeta function $\zeta(s)$. For $\sigma_0\le\frac12$, we show that the Riemannhypothesis is equivalent to the non-vanishing of $\zeta_{\mathcal P}(s)$ in theregion $\{\sigma>\frac12\}$. For every set of primes ${\mathcal P}$ that contains the prime $2$ and whosecounting function satisfies an estimate of the form $$\pi_{\mathcalP}(x)=\delta\,\pi(x)+O\bigl((\log\log x)^{\varepsilon(x)}\bigr),$$ we show that${\mathcal P}$ is an asymptotic additive basis for ${\mathbb N}$, i.e., forsome integer $h=h({\mathcal P})>0$ the sumset $h{\mathcal P}$ contains all butfinitely many natural numbers. For example, an asymptotic additive basis for${\mathbb N}$ is provided by the set $$\{2,547,1229,1993,2749,3581,4421,5281\ldots\}, $$ which consists of $2$ andevery hundredth prime thereafter.
机译:修复$ \ delta \ in(0,1] $,$ \ sigma_0 \ in [0,1)$和一个实值函数$ \ varepsilon(x)$,其中$ \ limsup_ {x \ to \ infty} \ varepsilon(x)\ le 0 $。对于每个素数$ {\ mathcal P} $,其计数函数$ \ pi _ {\ mathcal P}(x)$都满足$$ \ pi _ {\ mathcalP}(x)= \ delta \,\ pi形式的估计(x)+ O \ bigl(x ^ {\ sigma_0 + \ varepsilon(x)} \ bigr),$$我们定义了与Riemannzeta函数$密切相关的azeta函数$ \ zeta _ {\ mathcal P}(s)$ \ zeta(s)$。对于$ \ sigma_0 \ le \ frac12 $,我们证明黎曼假设等同于$ \ {\ sigma> \ frac12 \} $区域中的$ \ zeta _ {\ mathcal P}(s)消失。对于包含素数$ 2 $且其计数函数满足形式$$ \ pi _ {\ mathcalP}(x)= \ delta \,\ pi(x)+ O的估计的每个素数$ {\ mathcal P} $ \ bigl((\ log \ log x)^ {\ varepsilon(x)} \ bigr),$$我们表明$ {\ mathcal P} $是$ {\ mathbb N} $的渐近加法基础,即,对于某个整数$ h = h({\ mathcal P})> 0 $,总和$ h {\ mathcal P} $包含所有无限多个自然数。例如,$ {\ mathbb N} $的渐近可加基由集合$$ \ {2,547,1229,1993,2749,3581,4421,5281 \ ldots \}提供,$ $$由$ 2 $和每此后的百分之一百。

著录项

  • 作者

    Banks, William D.;

  • 作者单位
  • 年度 2015
  • 总页数
  • 原文格式 PDF
  • 正文语种
  • 中图分类

相似文献

  • 外文文献
  • 中文文献
  • 专利
代理获取

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号